383 research outputs found
The Poisson multiple access channel
Cover title. "Presented in part at IEEE Info Theory Workshop, June 9-13, Haifa, Israel."Includes bibliographical references (p. 29-32).Research supported by the Laboratory for Information and Decision Systems, Massachusetts Institute of Technology. DAAH04-95-1-0103Lapidoth, A., Shamai, Shlomo (Shitz)
On the Dirty Paper Channel with Fast Fading Dirt
Costa`s "writing on dirty paper" result establishes that full state
pre-cancellation can be attained in the Gel`fand-Pinsker problem with additive
state and additive white Gaussian noise. This result holds under the
assumptions that full channel knowledge is available at both the transmitter
and the receiver. In this work we consider the scenario in which the state is
multiplied by an ergodic fading process which is not known at the encoder. We
study both the case in which the receiver has knowledge of the fading and the
case in which it does not: for both models we derive inner and outer bounds to
capacity and determine the distance between the two bounds when possible. For
the channel without fading knowledge at either the transmitter or the receiver,
the gap between inner and outer bounds is finite for a class of fading
distributions which includes a number of canonical fading models. In the
capacity approaching strategy for this class, the transmitter performs Costa`s
pre-coding against the mean value of the fading times the state while the
receiver treats the remaining signal as noise. For the case in which only the
receiver has knowledge of the fading, we determine a finite gap between inner
and outer bounds for two classes of discrete fading distribution. The first
class of distributions is the one in which there exists a probability mass
larger than one half while the second class is the one in which the fading is
uniformly distributed over values that are exponentially spaced apart.
Unfortunately, the capacity in the case of a continuous fading distribution
remains very hard to characterize
MIMO Gaussian Broadcast Channels with Confidential and Common Messages
This paper considers the problem of secret communication over a two-receiver
multiple-input multiple-output (MIMO) Gaussian broadcast channel. The
transmitter has two independent, confidential messages and a common message.
Each of the confidential messages is intended for one of the receivers but
needs to be kept perfectly secret from the other, and the common message is
intended for both receivers. It is shown that a natural scheme that combines
secret dirty-paper coding with Gaussian superposition coding achieves the
secrecy capacity region. To prove this result, a channel-enhancement approach
and an extremal entropy inequality of Weingarten et al. are used.Comment: Submitted to 2010 IEEE International Symposium on Information Theory,
Austin, Texa
New Results on Multiple-Input Multiple-Output Broadcast Channels with Confidential Messages
This paper presents two new results on multiple-input multiple-output (MIMO)
Gaussian broadcast channels with confidential messages. First, the problem of
the MIMO Gaussian wiretap channel is revisited. A matrix characterization of
the capacity-equivocation region is provided, which extends the previous result
on the secrecy capacity of the MIMO Gaussian wiretap channel to the general,
possibly imperfect secrecy setting. Next, the problem of MIMO Gaussian
broadcast channels with two receivers and three independent messages: a common
message intended for both receivers, and two confidential messages each
intended for one of the receivers but needing to be kept asymptotically
perfectly secret from the other, is considered. A precise characterization of
the capacity region is provided, generalizing the previous results which
considered only two out of three possible messages.Comment: Submitted to the IEEE Transactions on Information Theory, 11 pages, 5
figure
Cooperative Multi-Cell Networks: Impact of Limited-Capacity Backhaul and Inter-Users Links
Cooperative technology is expected to have a great impact on the performance
of cellular or, more generally, infrastructure networks. Both multicell
processing (cooperation among base stations) and relaying (cooperation at the
user level) are currently being investigated. In this presentation, recent
results regarding the performance of multicell processing and user cooperation
under the assumption of limited-capacity interbase station and inter-user
links, respectively, are reviewed. The survey focuses on related results
derived for non-fading uplink and downlink channels of simple cellular system
models. The analytical treatment, facilitated by these simple setups, enhances
the insight into the limitations imposed by limited-capacity constraints on the
gains achievable by cooperative techniques
- …